Turán's theorem in sparse random graphs
نویسندگان
چکیده
We prove the analogue of Turán’s Theorem in random graphs with edge probability p(n) À n−1/(k−1.5). With probability 1 − o(1), one needs to delete approximately 1 k−1–fraction of the edges in a random graph in order to destroy all cliques of size k.
منابع مشابه
Turánnical hypergraphs
This paper is motivated by the question of how global and dense restriction sets in results from extremal combinatorics can be replaced by less global and sparser ones. The result we consider here as an example is Turán’s theorem, which deals with graphs G = ([n], E) such that no member of the restriction set R = ` [n] r ́ induces a copy of Kr. Firstly, we examine what happens when this restrict...
متن کاملA Turán Theorem for Random Graphs Dean of the Graduate School Date a Turán Theorem for Random Graphs a Turán Theorem for Random Graphs
of a thesis submitted to the Faculty of the Graduate School of Emory University in partial fulfillment of the requirements of the degree of Master of Science Department of Mathematics and Computer Science
متن کاملOn Turáns theorem for sparse graphs
a?nl(t+1) where a denotes the maximum size of an independent set in G. We improve this bound for graphs containing no large cliques. 0. Notation n=n(G)=number of vertices of the graph G e=e(G)=number of edges of G h=h(G)=number of triangles in G deg (P)=valency (degree) of the vertex P deg, (P) = triangle-valency of P=number of triangles in G adjacent to P t=t(G)=n f deg (P) = 2eln = average va...
متن کاملMantel's Theorem for random graphs
For a graph G, denote by t(G) (resp. b(G)) the maximum size of a triangle-free (resp. bipartite) subgraph of G. Of course t(G) ≥ b(G) for any G, and a classic result of Mantel from 1907 (the first case of Turán’s Theorem) says that equality holds for complete graphs. A natural question, first considered by Babai, Simonovits and Spencer about 20 years ago is, when (i.e. for what p = p(n)) is the...
متن کاملTurán's theorem for pseudo-random graphs
The generalized Turán number ex(G,H) of two graphs G and H is the maximum number of edges in a subgraph of G not containing H. When G is the complete graph Km on m vertices, the value of ex(Km, H) is (1−1/(χ(H)−1)+o(1)) ` m 2 ́ , where o(1) → 0 as m→∞, by the Erdős–Stone–Simonovits Theorem. In this paper we give an analogous result for triangle-free graphs H and pseudo-random graphs G. Our conce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 23 شماره
صفحات -
تاریخ انتشار 2003